On the hierarchies of universal predicates
نویسنده
چکیده
We investigate a hierarchy of arithmetical structures obtained by transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of definability. We determine the upper bound of the hierarchy and give a characterisation for the sets definable in the hierarchy.
منابع مشابه
2 4 M ar 2 00 7 On the hierarchies of universal predicates
We investigate a hierarchy of arithmetical structures obtained by transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of definability. We determine the upper bound of the hierarchy and give a characterisation for the sets definable in the hierarchy.
متن کاملAlternation Hierarchies of First Order Logic with Regular Predicates
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with regular numerical predicates. In this paper, we focus on the quantifier alternation hierarchies of first order logic. We obtain that deciding this problem for each level of the alternation hierarchy of both first order logic and its twovariable fragment when equipped wi...
متن کاملThe Interlanguage of Persian Learners of Italian: a Focus on Complex Predicates
This paper aims at investigating the acquisition of Italian complex predicates by native speakers of Persian. Complex predication is not as pervasive a phenomenon in Italian as it is in Persian. Yet Italian native speakers use complex predicates productively; spontaneous data show that Persian learners of Italian seem to be perfectly aware of Italian complex predicates and use this familiar fea...
متن کاملEvent, Property, and Hierarchy in Order-Sorted Logic
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could construct a logic that includes both predicates and terms as classes in the hierarchies, it would be very useful for connecting general knowledge to specic knowledge. Although there are actually logics that are equipped...
متن کاملA Hierarchical Planner that Generates Its Own Hierarchies
PABLO’ is a nonlinear planner that reasons hierarchically by generating abstract predicates. PABLO’s abstract search spaces are generated automatically using predicate relaxation, a new technique for defining hierarchies of abstract predicates. For some domains, this mechanism generates hierarchies that are more useful than those created by previous techniques. Using abstractions can lead to su...
متن کامل